Discrete Convex Simulation Optimization
نویسندگان
چکیده
منابع مشابه
Convex Discrete Optimization
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial optimization problems and convex integer programming problems in variable dimension. We discuss some of the many applications of this theory including to quadratic prog...
متن کاملDiscrete Optimization via Simulation Using COMPASS
We propose an optimization-via-simulation algorithm, called COMPASS, for use when the performance measure is estimated via a stochastic, discrete-event simulation, and the decision variables are integer ordered. We prove that COMPASS converges to the set of local optimal solutions with probability 1 for both terminating and steady-state simulation, and for both fully constrained problems and pa...
متن کاملOptimization of Stochastic Discrete Event Simulation Models
This short note gives a brief overview of optimization approaches for stochastic discrete event simulation. In particular it shows how by the combination of different methods hybrid algorithms can be composed that allow a fairly efficient and reliable optimization of medium sized models.
متن کاملOptimization via Simulation Over Discrete Decision Variables
Both the simulation research and software communities have been interested in optimization via simulation (OvS), by which we mean maximizing or minimizing the expected value of some output of a stochastic simulation. Continuous-decision-variable OvS, and gradient estimation to support it, has been an active research area with significant advances. However, the decision variables in many operati...
متن کاملQuasi M-convex and L-convex functions--quasiconvexity in discrete optimization
We introduce two classes of discrete quasiconvex functions, called quasi M-convex and L-convex functions, by generalizing the concepts of M-convexity and L-convexity due to Murota (1996, 1998). We investigate the structure of quasi M-convex and L-convex functions with respect to level sets, and show that various greedy algorithms work for the minimization of quasi M-convex and L-convex function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2020
ISSN: 1556-5068
DOI: 10.2139/ssrn.3721073